Uncertain Chance-Constrained Model for Energy Consumption in the Permutation Flow Shop

A bi-objective model for the assembly flow shop scheduling problem with sequence dependent setup times and considering energy consumption

A chance-constrained multi-objective model for final assembly scheduling in ATO systems with uncertain sub-assembly availability

A chance-constraint multi-objective model under uncertainty in the availability of subassemblies is proposed for scheduling in ATO systems. The on-time delivery of customer orders as well as reducing the company's cost is crucial; therefore, a three-objective model is proposed including the minimization of1) overtime, idletime, change-over, and setup costs, 2) total dispersion of items’ deliver...

Chance-Constrained Model for RCPSP with Uncertain Durations

Project scheduling with uncertain durations becomes a research focus with the development of uncertainty theory. Most researches concerned aim at minimizing project makespan or project cost according to different decision criterions. However, few works considered resource constraint, which initially appeared in deterministic resource-constrained project scheduling problem (RCPSP) and reflects t...

Uncertain Chance-constrained Programming Model for Project Scheduling Problem

Project scheduling problem is to determine the schedule of allocating the loans to a project in order to balance the total cost and the completion time of the project under some constraints. This paper considers project scheduling problem in an uncertain environment, of which the duration time of each activity is an uncertain variable. Then uncertain chance-constrained programming model is cons...

Tight Bounds for Permutation Flow Shop Scheduling

In flow shop scheduling there are m machines and n jobs, such that every job has to be processed on the machines in the fixed order 1, . . . , m. In the permutation flow shop problem, it is also required that each machine processes the set of all jobs in the same order. Formally, given n jobs along with their processing times on each machine, the goal is to compute a single permutation of the j...